Adaptive fault-tolerant routing in hypercube multicomputers
نویسندگان
چکیده
منابع مشابه
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
A connected hypercube with faulty links and/or nodes is called an injured hypercube. To enable any non-faulty node to communicate with any other non-faulty node in an injured hypcrcube, the information on component failures has to be made available to non-faulty nodes so as to route messages around the faulty components. We propose first a distributed adaptive fault-tolerant routing scheme for ...
متن کاملFault-Tolerant Sorting Algorithm on Hypercube Multicomputers
In this paper, algorithmic fault-tolerant techniques are introduced for sorting algorithms on n-dimensional hypercube multi-computers. We propose a fault-tolerant sorting algorithm that can tolerate up to n-1 faulty processors. Fit, we indicate that the bitouic sorting algorithm cau perform sorting operations correctly on hypercubes with one faulty processor. In order to tolerate up to rsn-1 fa...
متن کاملAdaptive Wormhole Routing in Hypercube Multicomputers
In this paper, we propose a uniform adaptive routing strategy for wormhole-routed hypercube networks that accommodates both unicast and multicast communication. Based on a node labeling method, the resultant routing algorithms are shown to be deadlock-free without requiring virtual channels. The order in which the destinations are visited is important to ee-ciency. We present an ordering algori...
متن کاملDistributed Fault-tolerant Routing in a Hypercube
A ABSTRACT connected hypercube containing faulty nodes/links is called an injured hypercube, f whereas a hypercube without faulty components is called a healthy hypercube. To allow non-aulty nodes in an injured hypercube to communicate with one another, each hypercube node has to be equipped with enough information so as to make correct routing decisions, and 1 y c update the information whenev...
متن کاملQoS Routing in Hypercube Multicomputers
"!$# &% %' )( +*, -%.($ /! 0 12 . 354 !$# 12 ! 10 % ! .($ 76 198 : 1 ( 4 ! ;1 <#/= %' )($ >' 4 ? ! 1 4 % ! )($ @ # A 12 3B4 !$# 12 5>C D1 E? 1/ ?; F G ? 3 1 ($ !$# 4 * # )($ < #D 12 /! )(H ! *5 !$# ! 3 # >'1 ($ ! 1 3 !$# )(I6 1/8J 1 ( 4 ! 1 K8.%' ) MLC ?;? = #N 12 . 4 /! O P6 1/8GQ ! 1 (<* # )($ !$# SR :T!$# )?; 4 /! ($ )% ($ /! !$# 3 C (H /! U6 198V%' )( 1 ( 4 ! 1W W ! :
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 1990
ISSN: 0018-9340
DOI: 10.1109/12.61061